/*---------------------------------------------------------------------------*\
  =========                 |
  \\      /  F ield         | foam-extend: Open Source CFD
   \\    /   O peration     | Version:     4.1
    \\  /    A nd           | Web:         http://www.foam-extend.org
     \\/     M anipulation  | For copyright notice see file Copyright
-------------------------------------------------------------------------------
License
	This file is part of foam-extend.

	foam-extend is free software: you can redistribute it and/or modify it
	under the terms of the GNU General Public License as published by the
	Free Software Foundation, either version 3 of the License, or (at your
	option) any later version.

	foam-extend is distributed in the hope that it will be useful, but
	WITHOUT ANY WARRANTY; without even the implied warranty of
	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
	General Public License for more details.

	You should have received a copy of the GNU General Public License
	along with foam-extend.  If not, see <http://www.gnu.org/licenses/>.

\*---------------------------------------------------------------------------*/

#ifndef HashSet_C
#define HashSet_C

#include "HashSet.H"

// * * * * * * * * * * * * * * * * Constructors  * * * * * * * * * * * * * * //

template<class Key, class Hash>
template<class AnyType, class AnyHash>
Foam::HashSet<Key, Hash>::HashSet
(
	const HashTable<AnyType, Key, AnyHash>& h
)
:
	HashTable<nil, Key, Hash>(h.size())
{
	for
	(
		typename HashTable<AnyType, Key, AnyHash>::const_iterator
		cit = h.cbegin();
		cit != h.cend();
		++cit
	)
	{
		this->insert(cit.key());
	}
}


// * * * * * * * * * * * * * * * Member Functions  * * * * * * * * * * * * * //

template<class Key, class Hash>
Foam::label Foam::HashSet<Key, Hash>::insert(const UList<Key>& lst)
{
	label count = 0;
	forAll(lst, elemI)
	{
		if (this->insert(lst[elemI]))
		{
			++count;
		}
	}

	return count;
}


// * * * * * * * * * * * * * * * Member Operators  * * * * * * * * * * * * * //

template<class Key, class Hash>
inline bool Foam::HashSet<Key, Hash>::operator[](const Key& key) const
{
	return this->found(key);
}


template<class Key, class Hash>
bool Foam::HashSet<Key, Hash>::operator==(const HashSet<Key, Hash>& rhs) const
{
	// Are all lhs elements in rhs?
	for (const_iterator iter = this->cbegin(); iter != this->cend(); ++iter)
	{
		if (!rhs.found(iter.key()))
		{
			return false;
		}
	}

	// Are all rhs elements in lhs?
	for (const_iterator iter = rhs.cbegin(); iter != rhs.cend(); ++iter)
	{
		if (!this->found(iter.key()))
		{
			return false;
		}
	}

	return true;
}


template<class Key, class Hash>
bool Foam::HashSet<Key, Hash>::operator!=(const HashSet<Key, Hash>& rhs) const
{
	return !(operator==(rhs));
}


template<class Key, class Hash>
void Foam::HashSet<Key, Hash>::operator|=(const HashSet<Key, Hash>& rhs)
{
	// Add rhs elements into lhs
	for (const_iterator iter = rhs.cbegin(); iter != rhs.cend(); ++iter)
	{
		this->insert(iter.key());
	}
}


template<class Key, class Hash>
void Foam::HashSet<Key, Hash>::operator&=(const HashSet<Key, Hash>& rhs)
{
	// Remove elements not also found in rhs
	for (iterator iter = this->begin(); iter != this->end(); ++iter)
	{
		if (!rhs.found(iter.key()))
		{
			this->erase(iter);
		}
	}
}


template<class Key, class Hash>
void Foam::HashSet<Key, Hash>::operator^=(const HashSet<Key, Hash>& rhs)
{
	// Add missed rhs elements, remove duplicate elements
	for (const_iterator iter = rhs.cbegin(); iter != rhs.cend(); ++iter)
	{
		if (this->found(iter.key()))
		{
			this->erase(iter.key());
		}
		else
		{
			this->insert(iter.key());
		}
	}
}


// same as HashTable::erase()
template<class Key, class Hash>
void Foam::HashSet<Key, Hash>::operator-=(const HashSet<Key, Hash>& rhs)
{
	// Remove rhs elements from lhs
	for (const_iterator iter = rhs.cbegin(); iter != rhs.cend(); ++iter)
	{
		this->erase(iter.key());
	}
}


/* * * * * * * * * * * * * * * * Global operators  * * * * * * * * * * * * * */

template<class Key, class Hash>
Foam::HashSet<Key, Hash>
Foam::operator|
(
	const HashSet<Key, Hash>& hash1,
	const HashSet<Key, Hash>& hash2
)
{
	HashSet<Key, Hash> out(hash1);
	out |= hash2;
	return out;
}


template<class Key, class Hash>
Foam::HashSet<Key, Hash>
Foam::operator&
(
	const HashSet<Key, Hash>& hash1,
	const HashSet<Key, Hash>& hash2
)
{
	HashSet<Key, Hash> out(hash1);
	out &= hash2;
	return out;
}


template<class Key, class Hash>
Foam::HashSet<Key, Hash>
Foam::operator^
(
	const HashSet<Key, Hash>& hash1,
	const HashSet<Key, Hash>& hash2
)
{
	HashSet<Key, Hash> out(hash1);
	out ^= hash2;
	return out;
}

// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //

#endif

// ************************************************************************* //
